Tootfinder

“…the problem, for viewers, isn’t wokeness run amok; it’s the incoherence of the world we are watching. We see an African man solving crimes in a rural English village of the 1950s, as the sun sets on the empire — yet his race is barely mentioned or considered and never makes any material difference in his experience.”

Hollywood’s New Fantasy: A Magical, Colorblind Past
Films and TV shows keep reimagining history as a multiracial dream world. Is that really a step forward?

This https://arxiv.org/abs/2303.00614 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csNE_…

A Hybrid Genetic Algorithm with Type-Aware Chromosomes for Traveling Salesman Problems with Drone
There are emerging transportation problems known as the Traveling Salesman Problem with Drone (TSPD) and the Flying Sidekick Traveling Salesman Problem (FSTSP) that involve using a drone in conjunction with a truck for package delivery. This study presents a hybrid genetic algorithm for solving TSPD and FSTSP by incorporating local search and dynamic programming. Similar algorithms exist in the literature. Our algorithm, however, considers more sophisticated chromosomes and less computationally…

This https://arxiv.org/abs/2303.00614 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csNE_…

A Hybrid Genetic Algorithm with Type-Aware Chromosomes for Traveling Salesman Problems with Drone
There are emerging transportation problems known as the Traveling Salesman Problem with Drone (TSPD) and the Flying Sidekick Traveling Salesman Problem (FSTSP) that involve using a drone in conjunction with a truck for package delivery. This study presents a hybrid genetic algorithm for solving TSPD and FSTSP by incorporating local search and dynamic programming. Similar algorithms exist in the literature. Our algorithm, however, considers more sophisticated chromosomes and less computationally…

Time and frequency transfers in optical spacetime
Adrien Bourgoin (SYRTE, Observatoire de Paris, PSL Research University, CNRS, Sorbonne Universit\'e, UPMC, Univ. Paris 06, Paris, France), Pierre Teyssandier (SYRTE, Observatoire de Paris, PSL Research University, CNRS, Sorbonne Universit\'e, UPMC, Univ. Paris 06, Paris, France), Paolo Tortora (Dipartimento di Ingegneria Industriale, Alma Mater Studiorum - Universit\`a di Bologna, Forl\`i, Italy), Marco Zannoni (Dipartimento di …

Time and frequency transfers in optical spacetime
Solving the null geodesic equations for a ray of light is a difficult task even considering a stationary spacetime. The problem becomes even more difficult if the electromagnetic signal propagates through a flowing optical medium. Indeed, because of the interaction between light and matter, the signal does not follow a null geodesic path of the spacetime metric anymore. However, having a clear description of how the time and frequency transfers are affected in this very situation is of a prime …

This https://arxiv.org/abs/2311.05644 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_mat…

On the tractability of Nash equilibrium
In this paper, we propose a method for solving a PPAD-complete problem [Papadimitriou, 1994]. Given is the payoff matrix $C$ of a symmetric bimatrix game $(C, C^T)$ and our goal is to compute a Nash equilibrium of $(C, C^T)$. In this paper, we devise a nonlinear replicator dynamic (whose right-hand-side can be obtained by solving a pair of convex optimization problems) with the following property: Under any invertible $0 < C \leq 1$, every orbit of our dynamic starting at an interior strategy o…

Seymour's second neighbourhood conjecture: random graphs and reductions
Alberto Espuny D\'iaz, Ant\'onio Gir\~ao, Bertille Granet, Gal Kronenberg
https://arxiv.org/abs/2403.02842

Seymour's second neighbourhood conjecture: random graphs and reductions
A longstanding conjecture of Seymour states that in every oriented graph there is a vertex whose second outneighbourhood is at least as large as its outneighbourhood. In this short note we show that, for any fixed $p\in[0,1/2)$, a.a.s. every orientation of $G(n,p)$ satisfies Seymour's conjecture (as well as a related conjecture of Sullivan). This improves on a recent result of Botler, Moura and Naia. Moreover, we show that $p=1/2$ is a natural barrier for this problem, in the following sense: f…

Condensed-Phase Quantum Chemistry
Paul J. Robinson, Adam Rettig, Hieu Q. Dinh, Meng-Fu Chen, Joonho Lee
https://arxiv.org/abs/2403.13207 https://

Condensed-Phase Quantum Chemistry
Molecular quantum chemistry has seen enormous progress in the last few decades thanks to the more advanced and sophisticated numerical techniques and computing power. Following the recent interest in extending these capabilities to condensed-phase problems, we summarize basic knowledge of condensed-phase quantum chemistry for ones with experience in molecular quantum chemistry. We highlight recent efforts in this direction, including solving the electron repulsion integrals bottleneck and imple…

This https://arxiv.org/abs/2209.11571 has been replaced.
link: https://scholar.google.com/scholar?q=a

A Jacobi-type Newton method for Nash equilibrium problems with descent guarantees
A common strategy for solving an unconstrained two-player Nash equilibrium problem with continuous variables is applying Newton's method to the system of nonlinear equations obtained by the corresponding first-order necessary optimality conditions. However, when taking into account the game dynamics, it is not clear what is the goal of each player when considering that they are taking their current decision following Newton's iterates. In this paper we provide an interpretation for Newton's ite…